Identity of King and Flajolet & al. Formulae for LRU Miss Rate Exact Computation
نویسنده
چکیده
There exist two formulae for the exact computation of LRU Miss Rate. As early as 1971 W.F. King derived a formula to compute the fault probability (‘miss rate’) of LRU demand paging systems [King71]. And, in 1992, Flajolet et al. gave an integral formula of that probability [Flajolet92]. In their paper, Flajolet et al. mention that “King gave another form of that probability”, implying that they used a different method for counting the same thing. However, to our knowledge, a formal equivalence between these two formulae has never been established yet. In this paper we show a direct equivalence between the two by algebraic means.
منابع مشابه
Approximation of LRU Caches Miss Rate: Application to Power-law Popularities
Building on the 1977 pioneering work of R. Fagin, we give a closed-form expression for the approximated Miss Rate (MR) of LRU Caches assuming a power-law popularity. Asymptotic behavior of this expression is an already known result when power-law parameter is above 1. |It is extended to any value of the parameter. In addition, we bring a new analysis of the conditions (cache relative size, popu...
متن کاملSimple Penalty-Sensitive Cache Replacement Policies
Classic cache replacement policies assume that miss costs are uniform. However, the correlation between miss rate and cache performance is not as straightforward as it used to be. Ultimately, the true performance cost of a miss should be its access penalty, i.e. the actual processing bandwidth lost because of the miss. Contrary to loads, the penalty of stores is mostly hidden in modern processo...
متن کاملA Preliminary Attempt for an Analytical Cache Replacement Algorithm Based on Poisson Processes and Maximum Likelihood Estimator
The Least Recently Used (LRU) algorithm has long been the most widely used algorithm for cache replacement. LRU boldly assumes that a block that is least recently used will be the least probable of being reused in the near future and thus should be replaced on contention. Unlike the LRU algorithm, which makes assumption of likelihood, this paper tentatively presents an analytical approach, usin...
متن کاملEvaluation of the Formulae Based on Red Blood Cell Indices in Differentiating Between Iron Deficiency Anemia and Beta Thalasemia Minor
Background and Aims: Iron deficiency anemia (IDA) and beta thalassemia minor (BTM) are the most common hypochromic microcytic anemias, and it is regarded important to differentiate between them. several formulae can be taken into consideration based on red blood cell (RBC) parameters in order to distinguish between these two disorders. Hence, the present study intended to evaluate the sensitivi...
متن کاملEnhancing LTP-Driven Cache Management Using Reuse Distance Information
Traditional caches employ the LRU management policy to drive replacement decisions. However, previous studies have shown LRU can perform significantly worse than the theoretical optimum, OPT [1]. To better match OPT, it is necessary to aggressively anticipate the future memory references performed in the cache. Recently, several researchers have tried to approximate OPT management by predicting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1607.01283 شماره
صفحات -
تاریخ انتشار 2016